Decentralized quickest change detection
نویسنده
چکیده
A decentralized formulation of the quickest change detection problem is studied, where the distributions of the observations at all of the sensors in the system change at the time of disruption, and the sensors communicate with a common fusion center. A Bayesian setting is considered in which a priori knowledge of the change time distribution is available. The observations are assumed to be independent from sensor to sensor, conditioned on the change hypothesis. An optimal solution to the problem is derived under a quasi-classical information structure, where each sensor retains only its messages from the past (restricted local memory), and receives feedback from the fusion center about the past messages of the other sensors (full feedback). A technique for implementation of the optimal solution is given, and the solution is extended to the situation where a priori change time distribution information is not available. The structure of the optimal solution is then used to arrive at a simple suboptimal policy that does not require any past message information. Numerical examples are given, which illustrate that the optimal solution offers little improvement over the suboptimal one, i.e., that feedback from the fusion center cannot be exploited to improve performance.
منابع مشابه
Asymptotically Optimal Quickest Change Detection in Distributed Sensor Systems
In the standard formulation of the quickest change-point detection problem, a sequence of observations, whose distribution changes at some unknown point in time, is available to a decision maker, and the goal is to detect this change as quickly as possible, subject to false alarm constraints. In this paper, we study the quickest change detection problem in the setting where the information avai...
متن کاملQuickest Change Detection in Hidden Markov Models for Sensor Networks
The decentralized quickest change detection problem is studied in sensor networks, where a set of sensors receive observations from a hidden Markov model (HMM) X and send sensor messages to a central processor, called the fusion center, which makes a final decision when observations are stopped. It is assumed that the parameter θ in the hidden Markov model for X changes from θ0 to θ1 at some un...
متن کاملNetworks of Biosensors: Decentralized Activation and Social Learning
This paper deals with the dynamics of biosensors and networks of biosensors, where individual biosensors are constructed out of protein molecules. Such biosensors are fully functioning nano-machines. The paper explores methods for decentralized self-activation of networks of biosensors using game-theoretic methods. A global game analysis in terms of a Bayesian game, and a correlated equilibrium...
متن کاملData-Efficient Quickest Change Detection
In the classical problem of quickest change detection, a decision maker observes a sequence of random variables. At some point in time, the distribution of the random variables changes abruptly. The objective is to detect this change in distribution with minimum possible delay, subject to a constraint on the false alarm rate. In many applications of quickest change detection, e.g., where the ch...
متن کاملQuickest Detection of Drift Change for Brownian Motion in Generalized Bayesian and Minimax Settings
The paper deals with the quickest detection of a change of the drift of the Brownian motion. We show that the generalized Bayesian formulation of the quickest detection problem can be reduced to the optimal stopping problem for a diffusion Markov process. For this problem the optimal procedure is described and its characteristics are found. We show also that the same procedure is asymptotically...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 47 شماره
صفحات -
تاریخ انتشار 2001